Anthropic's attempt to remove leaked Claude Code client source code from GitHub resulted in the accidental takedown of numerous legitimate forks of its official public code repository. While the overzealous takedown has been reversed, the company faces a significant challenge in containing the spread of the leaked code. The initial DMCA notice targeted a repository hosting the leak and nearly 100 forks, but expanded to impact over 8,100 repositories, including those forking Anthropic's public code. Coders complained about being caught in the dragnet. Despite efforts, copies of the leaked code remain available on platforms like Codeberg, and "clean room" reimplementations are emerging, potentially complicating legal issues.
This article details the rediscovery of the source code for AM and EURISKO, two groundbreaking AI programs created by Douglas Lenat in the 1970s and early 80s. AM autonomously rediscovered mathematical concepts, while EURISKO excelled in VLSI design and even defeated human players in the Traveller RPG. Lenat had previously stated he no longer possessed the code, but it was found archived on SAILDART, the original Stanford AI Laboratory backup data, and in printouts at the Computer History Museum. The code was password protected until Lenat's passing, and has now been made available on Github.
Directory listing of files related to the Mailreader project within the Xerox PARC Eros IFS.
The source code for the Apple II version of the LOGO programming language has been found! This is a significant discovery for computer history enthusiasts and those interested in the early days of programming education. The code was found on an old floppy disk and has been preserved and made available online.
MetaHTML is a web-programming language for creating various web-applications, from a web-page to a game. It's being ported to modern GNU/Linux systems and aims to be compatible with the latest versions of its dependencies. The page provides links to the project's homepage, downloads, support, bug tracking, task management, news, mailing lists, source code, and membership information.
The original INTERCAL-72 compiler source code, as both scans and transcriptions, has been rediscovered and is now available. The article details the history of INTERCAL, its influence on esolangs, and the process of getting the original compiler running on a modern system.
After constructing the graph to model the repository, it is amenable to standard graph algorithms. For this approach, we’ll turn to a popular algorithm for identifying the “key” elements of a graph called betweenness centrality. This algorithm assigns an integer score to each vertex; the higher the score, the more “central” the vertex. A vertex score is incremented if it falls on the shortest path between any two other vertices in the graph.
